搜索资源列表
ACASPS
- 一种基于MATLAB的蚁群算法路径仿真分析。-A kind of ant colony algorithm based on the MATLAB path simulation analysis.
ACO1
- 蚁群算法，对无人机路径进行有效规划，避免无人机相撞事故-Colony algorithm, effective UAV path planning to avoid drone crash
aca
- 蚁群算法求解最优路径的源代码 可执行，有输出图-Ant colony algorithm for optimal path of executable source code, there is the output map
Ant-Colony-Optimization
- 蚁群算法路径寻优，可以实现三维路径规划，可运行，得到最佳个体适应度变化趋势和寻路径过程。-Ant colony algorithm for route optimization, can achieve three-dimensional path planning, operations, get the best individual fitness trends and find the path process.
yiqun_matlab
- 基于蚁群算法的二维路径规划算法matlab源码-Based on a two-dimensional path planning algorithm ant colony algorithm matlab source
Ant-Colony-Algorithm-matlab
- 利用蚁群算法寻找以下10个城市的TSP最短路径。输出最短路径顺序及其长度，以及蚁群算法迭代过程中的最短路径长度进化曲线-Ant colony algorithm to find the following 10 cities TSP shortest path. Output sequence and the shortest path length, and the ant colony algorithm is an iterative process of evolution of the
ant
- 蚁群算法 解决TSP问题 程序对20个城市 数据进行计算 通过蚁群算法 计算最短路径 城市数据保存在当前目录下的 1173.txt 文件中-Ant colony algorithm to solve the TSP program for the calculation of 20 urban data through the ant colony algorithm to calculate the shortest path of urban data stored in the curre
ant
- 基于蚁群算法用MATLAB求解城市之间的最短路径问题，适合新手阅读使用-Read based on ant colony algorithm using MATLAB to solve the shortest path between cities, suitable for beginners
Ant_colony_algorithm_robot_path
- 蚁群算法在机器人路径规划中的应用，里面包含程序和论文，是一个课程作业。-Application of ant colony algorithm in robot path planning
ACO
- 蚁群算法(ant colony optimization, ACO),是一种用来寻找优化路径的机率型算法。-Ant colony algorithm (ant colony optimization, ACO), is a type of algorithm used to find the probability of the optimal path.
rengongyiqun
- 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。蚁群算法是一种模拟进化算法，初步的研究表明该算法具有许多优良的性质。针对PID控制器参数优化设计问题，将蚁群算法设计的结果与遗传算法设计的结果进行了比较，数值仿真结果表明，蚁群算法具有一种新的模拟进化优化方法的有效性和应用价值。-Ant colony algori
anti_TSP
- 蚁群算法是一种智能优化算法，通过介绍蚁群觅食过程中基于信息素的最短路径的搜索策略，给出基于MATLAB的蚁群算法在旅行商问题中的源代码m文件，对问题求解进行局部优化。-Ant colony algorithm is an intelligent optimization algorithm through the shortest route of pheromone search strategy based on the ant foraging process, given the ant
swarmintelligence.git
- 蚁群算法，效果较好,可实现交互式最优路径- Ant colony algorithm , the effect is better
an_first
- 蚁群算法源代码，解决TSP路径规划问题，可运行-Ant Colony Optimization
sanweilujing
- 利用蚁群算法做的一个三维路径规划，运行环境matlab2014a-Ant colony algorithm to do a three-dimensional path planning, the environment matlab2014a
yiqunsuanfa
- 蚁群算法解决TSP问题。通过蚁群算法解决一个城市的结合以及城市之间的旅行代价，寻找经过每个城市一次且仅一次而最终返回的旅行最小代价，及寻找最短路径。-Ant colony algorithm to solve TSP problem. Through the combination of ant colony algorithm to solve a city and cost of travel between cities, seeking after each city once and
TSP
- 能够解决旅行商的路径规划问题，是一个蚁群算法。-Can solve the traveling salesman problem of path planning is an ant colony algorithm.
ACA_FCM
- 蚁群算法用于求最短路径问题,是一种用来在图中寻找优化路径的机率型算法-Ant colony algorithm for the shortest path problem, is a kind of used to type the probability of finding optimal path algorithm in the picture
dual-robot-path-planning
- 双机器人协调路径规划，局部路径使用蚁群算法，全局路径使用粒子群算法-Double coordinate path planning and local path using ant colony algorithm, the global path using the particle swarm optimization
ant_colony
- 蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为。蚁群算法是一种模拟进化算法，初步的研究表明该算法具有许多优良的性质。-Ant algorithm is a probabilistic algorithm for finding optimal paths in graphs. It was suggested by Marco Dorigo in his doctoral thesi